Weighted Mean Squared Deviation Feature Screening for Binary Features

On Weighted Pcm and Mean Square Deviation

Minimizing weighted mean absolute deviation of job completion times from their weighted mean

We address a single-machine scheduling problem where the objective is to minimize the weighted mean absolute deviation of job completion times from their weighted mean. This problem and its precursors aim to achieve the maximum admissible level of service equity. It has been shown earlier that the unweighted version of this problem is NP-hard in the ordinary sense. For that version, a pseudo-po...

Root Mean Squared Error

• Predictive Accuracy Measures. These measures evaluate how close the recommender system came to predicting actual rating/utility values. • Classification Accuracy Measures. These measures evaluate the frequency with which a recommender system makes correct/incorrect decisions regarding items. • Rank Accuracy Measures. These measures evaluate the correctness of the ordering of items performed b...

Minimizing mean squared deviation of completion times with maximum tardiness constraint

We consider a nonpreemptive single-machine scheduling problem to minimize mean squared deviation of job completion times about a common due date with maximum tardiness constraint (MSD/Tmax problem), where the common due date is large enough so that it does not constrain the minimization of MSD. The MSD/Tmax problem is classi®ed into three cases according to the value of maximum allowable tardin...

Binary Elligator Squared

Applications of elliptic curve cryptography to anonymity, privacy and censorship circumvention call for methods to represent uniformly random points on elliptic curves as uniformly random bit strings, so that, for example, ECC network traffic can masquerade as random traffic. At ACM CCS 2013, Bernstein et al. proposed an efficient approach, called “Elligator,” to solving this problem for arbitr...